翻訳と辞書 Words near each other ・ Euclid's orchard ・ Euclid's theorem ・ Euclid, Minnesota ・ Euclid, Ohio ・ Euclid, West Virginia ・ Euclide Trotti ・ Euclidean ・ Euclidean algorithm ・ Euclidean distance ・ Euclidean distance matrix ・ Euclidean division ・ Euclidean domain ・ Euclidean field ・ Euclidean geometry ・ Euclidean group ・ Euclidean minimum spanning tree ・ Euclidean plane isometry ・ Euclidean quantum gravity ・ Euclidean random matrix ・ Euclidean relation ・ Euclidean rhythm ・ Euclidean shortest path ・ Euclidean space ・ Euclidean tilings by convex regular polygons ・ Euclidean topology ・ Euclidean vector ・ Euclideon ・ Euclides (crater) ・ Euclides da Cunha ・ Euclides da Cunha (disambiguation) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Euclidean minimum spanning tree ： ウィキペディア英語版 Euclidean minimum spanning tree The Euclidean minimum spanning tree or EMST is a minimum spanning tree of a set of ''n'' points in the plane (or more generally in ℝ''d''), where the weight of the edge between each pair of points is the Euclidean distance between those two points. In simpler terms, an EMST connects a set of dots using lines such that the total length of all the lines is minimized and any dot can be reached from any other by following the lines. In the plane, an EMST for a given set of points may be found in Θ(''n'' log ''n'') time using O(''n'') space in the algebraic decision tree model of computation. Faster randomized algorithms of complexity O(''n'' log log ''n'') are known in more powerful models of computation that more accurately model the abilities of real computers.〔.〕 In higher dimensions (''d'' ≥ 3), finding an optimal algorithm remains an open problem. ==Lower bound== An asymptotic lower bound of Ω(''n'' log ''n'') for time complexity of the EMST problem can be established in restricted models of computation, such as the algebraic decision tree and algebraic computation tree models, in which the algorithm has access to the input points only through certain restricted primitives that perform simple algebraic computations on their coordinates: in these models, the closest pair of points problem requires Ω(''n'' log ''n'') time, but the closest pair is necessarily an edge of the EMST, so the EMST also requires this much time.〔.〕 However, if the input points have integer coordinates and bitwise operations and table indexing operations are permitted using those coordinates, then faster algorithms are possible.〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Euclidean minimum spanning tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.